Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
نویسنده
چکیده
Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems from combinatorial optimization, e.g. matchings and branchings.
منابع مشابه
The complexity of approximating PSPACE-Complete problems for hierarchical specifications
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically speciied graphs, many of which are PSPACE-complete. Assuming P 6 = PSPACE, the existence or nonexistence of such eecient approximation algorithms is characterized, for several standard graph theoretic and combinatorial problems. We present polynomial time approximation algorithms for severa...
متن کاملDegree-Constrained Subgraph Problems: Hardness and Approximation Results
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This paper considers two natural Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems t...
متن کاملOn the approximability of some degree-constrained subgraph problems
In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph G = (V, E). Let d ≥ 2 be a fixed integer. The Maximum d-degree-bounded Connected Subgraph (MDBCSd) problem takes as additional input a weight function ω : E → R, and asks for a subset E′ ⊆ E such that the subgraph ...
متن کاملThe Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACEcomplete. We present polynomial time approximation algorithms for several standard PSPACE-hard problems considered in the literature. In contrast, we prove that finding -approximations for any > 0, for several other problems when the instances are s...
متن کاملSurvivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008